Automatic structures for semigroup constructions
نویسندگان
چکیده
We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix semigroups, Bruck-Reilly extensions and wreath products.
منابع مشابه
Unary FA-Presentable Semigroups
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of interesting decision problems. A particular focus of research has been the classification of those structures of some species that admit automatic presentations. Whilst some successes have been obtained, this appears to be a difficult pro...
متن کاملPresentations for Subsemigroups of Groups
This thesis studies subsemigroups of groups from three perspectives: automatic structures, ordinary semigroup presentations, and Malcev presentaions. [A Malcev presentation is a presentation of a special type for a semigroup that can be embedded into a group. A group-embeddable semigroup is Malcev coherent if all of its finitely generated subsemigroups admit finite Malcev presentations.] The th...
متن کاملAutomatic semigroups and Bruck–Reilly extensions
The interaction of automatic semigroups and Bruck–Reilly extensions is studied. It is proved that every automatic Bruck–Reilly extension has an automatic base semigroup. This result is then applied to answer negatively the question of Andrade et al. on whether automatic structures for Bruck–Reilly extensions of groups are characterized by the fellow traveller property. An example is exhibited t...
متن کاملAutomatic structures for subsemigroups of Baumslag–Solitar semigroups
This paper studies automatic structures for subsemigroups of Baumslag–Solitar semigroups (that is, semigroups presented by ⟨x, y | (yx, xy)⟩ where m,n ∈ N). A geometric argument (a rarity in the field of automatic semigroups) is used to show that if m > n, all of the finitely generated subsemigroups of this semigroup are [right-] automatic. If m < n, all of its finitely generated subsemigroups ...
متن کاملAutomatic Presentations for Cancellative Semigroups
This paper studies FA-presentable structures and gives a complete classification of the finitely generated FA-presentable cancellative semigroups. We show that a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group.
متن کامل